On-line Adaptive Chain Covering of Upgrowing Posets
نویسندگان
چکیده
We analyze on-line chain partitioning problem and its variants as a two-person game. One person (Spoiler) builds an on-line poset presenting one point at time. The other one (Algorithm) assigns new point to a chain. Kierstead gave a strategy for Algorithm showing that width w posets can be on-line chain partitioned into 5 −1 4 chains. Felsner proved that if Spoiler presents an upgrowing poset, i.e., each new point is maximal at the moment of its arrival then there is a strategy for Algorithm using at most `
منابع مشابه
M-chain graphs of posets
Covering graphs of various types of finite partially ordered sets have been extensively studied since Ore in [2] asked for a characterization of such graphs in general. In this note we introduce a graph, called the m-chain graph of a poset, that reduces to the covering graph when m = 1. Since we will show how to construct the m-chain graph for m > 2 as the 2-chain graph of another poset, we are...
متن کاملOn-line Chain Partitioning of Up-growing Interval Orders
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5 w −1 4 chains to cover poset of width w. Felsner [3] introduced a variant of this problem considering only up-growing posets, i.e. on-line posets in which each new point is maximal at the moment of its arrival. He presented an algorithm using (
متن کاملAn Improved Subexponential Bound for On-line Chain Partitioning
Bosek and Krawczyk exhibited an on-line algorithm for partitioning an on-line poset of width w into w lgw chains. They also observed that the problem of on-line chain partitioning of general posets of width w could be reduced to First-Fit chain partitioning of (2w + 1)-ladder-free posets of width w, where an m-ladder is the transitive closure of the union of two incomparable chains x1 6 . . . 6...
متن کاملAn Analogue of Covering Space Theory for Ranked Posets
Suppose P is a partially ordered set that is locally finite, has a least element, and admits a rank function. We call P a weighted-relation poset if all the covering relations of P are assigned a positive integer weight. We develop a theory of covering maps for weighted-relation posets, and in particular show that any weighted-relation poset P has a universal cover P̃ → P , unique up to isomorph...
متن کاملCobweb posets - Recent Results
SUMMARY Cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in the source papers ([6,7] and references therein to the first author).[7,6,8] include natural enquires to be reported on here. The purpose of this pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006